Cost-Effective Usage of Bitmap-Indexes in DS-Systems
نویسنده
چکیده
Index structures are a widely used function of Database Management Systems (DBMS) in order to tune them for a special purpose. Finding the right index configuration is on the one hand extremely complex (NP-problem [6]) and a variation of the Knapsack Problem [9] but on the other hand manual configuration requires high administrative effort by cost-intensive experts (like DBAs). Regarding these facts several approaches like Feedback Control Loop [14] or MAPE from IBM [7] were introduced in current research of self-tuning techniques. These proposals should reduce costs for human resources and bring us closer to more efficient autonomous DBS. Based on these perceptions we analysed the state of the art in the field of Data Warehousing and Online Analytical Processing (OLAP) systems. In this area it is noticeable that bitmap-indexes have often a marginal use in spite of crucial advantages in the given scenarios of DSS. Many case studies are available for the Oracle DBMS which has integrated a support for bitmap-indexes [8]. Instead we could find several approaches, which were based on heuristics of experts and DBAs like Join-Indexes [12, 4]. With the aid of these approaches it is possible to evaluate design tools like Database Tuning Advisor for Microsoft SQL Server 2005 [1, 2] or DB2 Design Advisor [15] and give online advise to tune a DBS, but until now it is not possible to give an online cost estimate for bitmap-indexes. Hence, a self-tuning approach like those for B-trees [3, 11] is not available yet.
منابع مشابه
Performance of Multi-Level and Multi-Component Compressed Bitmap Indexes
Bitmap indexes are known as the most effective indexing methods for range queries on append-only data, especially for low cardinality attributes. Recently, bitmap indexes were also shown to be just as effective for high cardinality attributes when certain compression methods are applied. There are many different bitmap indexes in the literature but no definite comparison among them has been mad...
متن کاملAutomatic Selection of Bitmap Join Indexes in Data Warehouses
The queries defined on data warehouses are complex and use several join operations that induce an expensive computational cost. This cost becomes even more prohibitive when queries access very large volumes of data. To improve response time, data warehouse administrators generally use indexing techniques such as star join indexes or bitmap join indexes. This task is nevertheless complex and fas...
متن کاملAccelerating Queries on Very Large Datasets
In this chapter, we explore ways to answer queries on large multi-dimensional data efficiently. Given a large dataset, a user often wants to access only a relatively small number of the records. Such a selection process is typically performed through an SQL query in a database management system (DBMS). In general, the most effective technique to accelerate the query answering process is indexin...
متن کاملYet Another Algorithms for Selecting Bitmap Join Indexes
One of the fundamental tasks that data warehouse (DW) administrator needs to perform during the physical design is to select the right indexes to speed up her/his queries. Two categories of indexes are available and supported by the main DBMS vendors: (i) indexes defined on a single table and (ii) indexes defined on multiple tables such as join indexes, bitmap join indexes, etc. Selecting relev...
متن کاملSBH: Super byte-aligned hybrid bitmap compression
Bitmap indexes are commonly used in data warehousing applications such as on-line analytic processing (OLAP). Storing the bitmaps in compressed form has been shown to be effective not only for low cardinality attributes, as conventional wisdom would suggest, but also for high cardinality attributes. Compressed bitmap indexes, such as Byte-aligned been shown to be efficient in terms of both time...
متن کامل